Using irreducible polynomials for random number generation
نویسندگان
چکیده
A method is presented for generating random numbers with uniform distribution using linear recurrence sequences very large period lengths. This requires an irreducible polynomial modulo 2 to define the sequence. suitable infinite number of such polynomials presented. The generated in this way can have arbitrarily degree, and a enough order make them practical applications.
منابع مشابه
Parity of the number of irreducible factors for composite polynomials
Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan’s theorem in which discriminants of polynomials over a finite field or the integral ring Z play an important role. In this paper we consider discriminants of the composition of some polynomials over finite fields. The ...
متن کاملassessment of human random number generation for biometric verification
random number generation is one of the human abilities. it is proven that the sequence of random numbers generated by people do not follow full randomness criteria. these numbers produced by brain activity seem to be completely non stationary. in this paper, we show that there is a distinction between the random numbers generated by different people who provides the discrimination capability, a...
متن کاملRandom Number Generation Using a Biased Source
We study random number generation using a biased source motivated by previous works on this topic, mainly, von Neumman (1951), Elias (1972), Knuth and Yao (1976) and Peres (1992). We study the problem in two cases: first, when the source distribution is unknown, and second, when the source distribution is known. In the first case, we characterize the functions that use a discrete random source ...
متن کاملNumber of Irreducible Polynomials in Several Variables over Finite Fields
We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.
متن کاملUsing Trace to Identify Irreducible Polynomials
We prove a criterion to check whether a polynomial is irreducible. This criterion is related to trace map computations. It may be effectively used to detect irreducibility of polynomials of prime degree over their base field.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Az Eszterházy Károly Tanárképz? F?iskola tudományos közleményei
سال: 2023
ISSN: ['1216-6014', '1787-6117', '1787-5021', '1589-6498']
DOI: https://doi.org/10.33039/ami.2022.12.012